Turing Impossibility Properties for Stack Machine Programming
نویسندگان
چکیده
The strong, intermediate, and weak Turing impossibility properties are introduced. Some facts concerning Turing impossibility for stack machine programming are trivially adapted from previous work. Several intriguing questions are raised about the Turing impossibility properties concerning different method interfaces for stack machine programming.
منابع مشابه
Modelling, Simulating and Verifying Turing-Powerful Strand Displacement Systems
We demonstrate how the DSD programming language can be used to design a DNA stack machine and to analyse its behaviour. Stack machines are of interest because they can efficiently simulate a Turing machine. We extend the semantics of the DSD language to support operations on DNA polymers and use our stack machine design to implement a non-trivial example: a ripple carry adder which can sum two ...
متن کاملVerifying polymer reaction networks using bisimulation
The Chemical Reaction Network model has been proposed as a programming language for molecular programming. Methods to implement arbitrary CRNs using DNA strand displacement circuits have been proposed, as have methods to prove the correctness of those or other implementations. However, the stochastic Chemical Reaction Network model is provably not deterministically Turing-universal, that is, it...
متن کاملAn XML-Based Cross-Language Framework
We introduce XMLVM, a Turing complete XML-based programming language based on a stack-based, virtual machine. We show how XMLVM can automatically be created from Java class-files and .NET’s Intermediate Language. While the programmer is never directly exposed to XMLVM, we provide tools based on XMLVM for tasks such as cross-language functional testing or code migration.
متن کاملOne-stack Automata as Acceptors of Context-free Languages*
This paper presents one-stack automata as acceptors of context-free languages; these are equivalent to Pushdown Automata which are well known in automata theory. As equivalence relations such as equivalence of Turing Machines and two-stack Pushdown Automata help in learning general properties of formal modeling, the equivalence relation of Pushdown Automata and one-stack automata also helps in ...
متن کاملA Performance Survey on Stack-based and Register-based Virtual Machines
Virtual machines have been widely adapted for high-level programming language implementations and for providing a degree of platform neutrality. As the overall use and adaptation of virtual machines grow, the overall performance of virtual machines has become a widely-discussed topic. In this paper, we present a survey on the performance differences of the two most widely adapted types of virtu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1201.6028 شماره
صفحات -
تاریخ انتشار 2012